By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 23, Issue 2, pp. 227-448

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs

Michael Kaufmann and Kurt Mehlhorn

pp. 227-246

BibTeX  Abstract Full Text:  PDF

Some Results on Elusive Graph Properties

Eberhard Triesch

pp. 247-254

BibTeX  Abstract Full Text:  PDF

Closeness of NP-Hard Sets to Other Complexity Classes

Bin Fu and Hong-Zhou Li

pp. 255-260

BibTeX  Abstract Full Text:  PDF

Complexity-Restricted Advice Functions

Johannes Köbler and Thomas Thierauf

pp. 261-275

BibTeX  Abstract Full Text:  PDF

Deterministic Simulations of PRAMs on Bounded Degree Networks

Kieran T. Herley and Gianfranco Bilardi

pp. 276-292

BibTeX  Abstract Full Text:  PDF

Lower Bounds for Randomized $k$-Server and Motion-Planning Algorithms

Howard Karloff, Yuval Rabani, and Yiftach Ravid

pp. 293-312

BibTeX  Abstract Full Text:  PDF

An Alphabet Independent Approach to Two-Dimensional Pattern Matching

Amihood Amir, Gary Benson, and Martin Farach

pp. 313-323

BibTeX  Abstract Full Text:  PDF

Trading Space for Time in Undirected $s$-$t$ Connectivity

Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, and Eli Upfal

pp. 324-334

BibTeX  Abstract Full Text:  PDF

Bounds on the Costs of Multivalued Register Implementations

Soma Chaudhuri and Jennifer L. Welch

pp. 335-354

BibTeX  Abstract Full Text:  PDF

Parallel Information Dissemination by Packets

A. Bagchi, E. F. Schmeichel, and S. L. Hakimi

pp. 355-372

BibTeX  Abstract Full Text:  PDF

Generating Linear Extensions Fast

Gara Pruesse and Frank Ruskey

pp. 373-386

BibTeX  Abstract Full Text:  PDF

Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees

H. Narayanan, Huzur Saran, and Vijay V. Vazirani

pp. 387-397

BibTeX  Abstract Full Text:  PDF

On the Consecutive-Retrieval Problem

R. Swaminathan and Donald K. Wagner

pp. 398-414

BibTeX  Abstract Full Text:  PDF

Polynomial Root-Finding Algorithms and Branched Covers

Myong-Hi Kim and Scott Sutherland

pp. 415-436

BibTeX  Abstract Full Text:  PDF

Computing and Verifying Depth Orders

Mark de Berg, Mark Overmars, and Otfried Schwarzkopf

pp. 437-446

BibTeX  Abstract Full Text:  PDF

Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems

John H. Reif and Sandeep Sen

pp. 447-448

BibTeX  Abstract Full Text:  PDF